Some Remarks on A ( 1 ) 1 Soliton Cellular Automata
نویسنده
چکیده
We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these laws.
منابع مشابه
0 Some remarks on A ( 1 ) 1 soliton cellular automata
We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these...
متن کاملFrom soliton equations to integrable cellular automata through a limiting procedure.
In order to investigate complex physical phenomenon, we have to adopt a simple model which exhibits essential features of the phenomenon. Cellular automata (CA’s) serve as such simple models and have been widely investigated in physics, chemistry, biology, and computer sciences [1]. They present a large variety of structures in their evolution. About a decade ago, Park, Steiglitz, and Thurston ...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملComplex Dynamics Emerging in Rule 30 with Majority Memory
In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and show that using the memory function we can transform quasi-chaotic dynamics of classical Rule 30 into domains of travelling structures with predictable behavio...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کامل